Sequential disruption of the shortest path in critical percolation
نویسندگان
چکیده
منابع مشابه
Pair Connectedness and Shortest Path Scaling in Critical Percolation
We present high statistics data on the distribution of shortest path lengths between two near-by points on the same cluster at the percolation threshold. Our data are based on a new and very efficient algorithm. For d = 2 they clearly disprove a recent conjecture by M. Porto et al., Phys. Rev. E 58, R5205 (1998). Our data also provide upper bounds on the probability that two near-by points are ...
متن کاملA critical exponent for shortest-path scaling in continuum percolation
We carry out Monte Carlo experiments to study the scaling behavior of shortest path lengths in continuum percolation. These studies suggest that the critical exponent governing this scaling is the same for both continuum and lattice percolation. We use splitting, a technique that has not yet been fully exploited in the physics literature, to increase the speed of our simulations. This technique...
متن کاملthe effect of using critical discourse analytical tools on the improvement of the learners level of critical thinking in reading comprehension
?it is of utmost priority for an experienced teacher to train the mind of the students, and enable them to think critically and correctly. the most important question here is that how to develop such a crucial ability? this study examines a new way to the development of critical thinking utilizing critical discourse analytical tools. to attain this goal, two classes of senior english la...
Exact critical exponent for the shortest-path scaling function in percolation
It is shown that the critical exponent g1 related to pair-connectiveness and shortestpath (or chemical distance) scaling, recently studied by Porto et al., Dokholyan et al., and Grassberger, can be found exactly in 2d by using a crossing-probability result of Cardy, with the outcome g1 = 25/24. This prediction is consistent with existing simulation results. [Published as J. Phys. A. 32, L457-45...
متن کاملSequential Shortest Path Interdiction with Incomplete Information
We study sequential interdiction when the interdictor has incomplete initial information about the network, and the evader has complete knowledge of the network, including its structure and arc costs. In each time period, the interdictor blocks at most k arcs from the network observed up to that period, after which the evader travels along a shortest path between two (fixed) nodes in the interd...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physical Review E
سال: 2019
ISSN: 2470-0045,2470-0053
DOI: 10.1103/physreve.100.032121